Constraint Based Design of ATM Networks, an Experimental Study

نویسندگان

  • Hongzhou Ma
  • Inderjeet Singh
  • Jonathan Turner
چکیده

This paper describes an experimental study of constraint-based network design. We used a novel network design tool, implemented in Java, to design representative networks joining major U.S. cities. The cost of three topologies: Best Star, Minimum Spanning Tree (MST), and Delaunay Triangulation, are compared, with and without localized tra c constraints. The best star network gives near optimal result when the tra c is only constrained by source and sink capacity of switches ( at tra c constraints). With localized tra c constraints, the most cost e ective network has a structure similar to the MST. The cheapest network has a tree structure when there are only at tra c constraints, but can have cycles when localized tra c constraints are present. Constraint Based Design of ATM Networks, an Experimental Study Hongzhou Ma Inderjeet Singh Jonathan Turner [email protected] [email protected] [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Effectiveness of 5E Educational Design model on Creativity and Social Participation of Mentally Retarded Children in Virtual Social Networks

Objective: The aim of this study was to determine the effect of Learning through Virtual Social Networks Based on the 5E Instructional Design Model on the Creativity and Social Participation of Mentally Retarded Children in the Experimental Sciences. Method: The research method was experimental and the experimental design was quasi-experimental with pretest-posttest and control group.  The stat...

متن کامل

M1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)

In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...

متن کامل

SEQUENTIAL PENALTY HANDLING TECHNIQUES FOR SIZING DESIGN OF PIN-JOINTED STRUCTURES BY OBSERVER-TEACHER-LEARNER-BASED OPTIMIZATION

Despite comprehensive literature works on developing fitness-based optimization algorithms, their performance is yet challenged by constraint handling in various engineering tasks. The present study, concerns the widely-used external penalty technique for sizing design of pin-jointed structures. Observer-teacher-learner-based optimization is employed here since previously addressed by a number ...

متن کامل

Enumeration of Dominant Solutions: An Application in Transport Network Design

A One-Dimensional Binary Integer Programming Problem (1DB-IPP) is concerned with selecting a subset from a set of k items in budget constraint to optimize an objective function. In this problem a dominant solution is defined as a feasible selection to which no further item could be added in budget constraint. This paper presents a simple algorithm for Enumeration of Dominant Solutions (EDS) and...

متن کامل

Experimental Evaluation of an ATM Host Interface

We have previously reported a design for a host interface board intended to connect workstations to ATM networks, and an implementation that was underway. Since then, we have made some modifications to the hardware architecture (mainly to support the Class 4 ATM Adaptation Layer), nearly completed the hardware implementation, and implemented software support. Our prototype connects an IBM RS/60...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997